Soundness and Completeness versus Lifting Property 1
نویسنده
چکیده
We give new formulations of the property of soundness and completeness of a resolution system and of the lifting lemma, and we discuss their relationship. The discussion points out why certain resolution systems are not complete, and that there is a simple method for showing that a resolution system is \absolutely incomplete" { that there is no notion of program completion and no logic which could give soundness and completeness. The method is demonstrated on the case of basic variants of the SLDNF-resolution. The same approach can be used to analyze other resolution systems.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملModal Kleene Algebra and Partial Correctness
We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions give rise to four modal operators. The boxes and diamonds enjoy various symmetries via Galois connections and dualities. Lifting modal statements to modal operator semirings yields a further abstraction and thus a more elegant and concise “statefree” reasoning about modalities. We use this modal ...
متن کاملFirst-order Multi-Modal Deduction1
We study prefixed tableaux for first-order multi-modal logic, providing proofs for soundness and completeness theorems, a Herbrand theorem on deductions describing the use of Herbrand or Skolem terms in place of parameters in proofs, and a lifting theorem describing the use of variables and constraints to describe instantiation. The general development applies uniformly across a range of regime...
متن کاملImporting Logics: Soundness and Completeness Preservation
Importing subsumes several asymmetric ways of combining logics, including modalization and temporalization. A calculus is provided for importing, inheriting the axioms and rules from the given logics and including additional rules for lifting derivations from the imported logic. The calculus is shown to be sound and concretely complete with respect to the semantics of importing as proposed in [...
متن کاملLifting of L-Narrowing Derivations
If conditional rewrite-rules are restricted to the form P =⇒ f(x1, . . . , xn)→ t where P is a finite set of equations, f is any function symbol, x1, . . . , xn are variables, and t is any term then the premise P contains in general variables which do not occur in the list x1, . . . , xn. The rule with premise P can be applied if P is satisfiable. Therefore, we need methods to solve P and narro...
متن کامل